Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Ben Lund and Aditya Potukuchi. On the List Recoverability of Randomly Punctured Codes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 30:1-30:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{lund_et_al:LIPIcs.APPROX/RANDOM.2020.30, author = {Lund, Ben and Potukuchi, Aditya}, title = {{On the List Recoverability of Randomly Punctured Codes}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {30:1--30:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.30}, URN = {urn:nbn:de:0030-drops-126330}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.30}, annote = {Keywords: List recovery, randomly punctured codes, Reed-Solomon codes} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Aditya Potukuchi. A Spectral Bound on Hypergraph Discrepancy. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 93:1-93:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{potukuchi:LIPIcs.ICALP.2020.93, author = {Potukuchi, Aditya}, title = {{A Spectral Bound on Hypergraph Discrepancy}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {93:1--93:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.93}, URN = {urn:nbn:de:0030-drops-125002}, doi = {10.4230/LIPIcs.ICALP.2020.93}, annote = {Keywords: Hypergraph discrepancy, Spectral methods, Beck-Fiala conjecture} }
Published in: LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Aditya Potukuchi. On the AC^0[oplus] Complexity of Andreev’s Problem. In 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 150, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{potukuchi:LIPIcs.FSTTCS.2019.25, author = {Potukuchi, Aditya}, title = {{On the AC^0\lbrackoplus\rbrack Complexity of Andreev’s Problem}}, booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-131-3}, ISSN = {1868-8969}, year = {2019}, volume = {150}, editor = {Chattopadhyay, Arkadev and Gastin, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.25}, URN = {urn:nbn:de:0030-drops-115879}, doi = {10.4230/LIPIcs.FSTTCS.2019.25}, annote = {Keywords: List Recovery, Sharp Threshold, Fourier Analysis} }
Feedback for Dagstuhl Publishing